First order theory of cyclically ordered groups
نویسندگان
چکیده
منابع مشابه
Pattern avoidance in cyclically ordered structures
We generalize the notion of pattern avoidance to arbitrary functions on ordered sets, and consider specifically three scenarios for permutations: linear, cyclic and hybrid, the first one corresponding to classical permutation avoidance. The cyclic modification allows for circular shifts in the entries. Using two bijections, both ascribable to both Deutsch and Krattenthaler independently, we sin...
متن کاملMinmax relations for cyclically ordered digraphs
We prove a range of minmax theorems about cycle packing and covering in digraphs whose vertices are cyclically ordered, a notion promoted by Bessy and Thomassé in their beautiful proof of the following conjecture of Gallai: the vertices of a strongly connected digraph can be covered by at most as many cycles as the stability number. The results presented here provide relations between cycle pac...
متن کاملFormal power series with cyclically ordered exponents
We define and study a notion of ring of formal power series with exponents in a cyclically ordered group. Such a ring is a quotient of various subrings of classical formal power series rings. It carries a two variable valuation function. In the particular case where the cyclically ordered group is actually totally ordered, our notion of formal power series is equivalent to the classical one in ...
متن کاملFirst Order Paths in Ordered Trees
We give two sufficient conditions on XPath like languages for having first order expressivity, meaning that every first order definable set of paths in an ordered node-labeled tree is definable in that XPath language. They are phrased in terms of expansions of navigational (sometimes called “Core”) XPath. Adding either complementation, or the more elegant conditional paths is sufficient. A cond...
متن کاملCyclically Presented Groups and Resultants
We consider the family of irreducible cyclically presented groups on n generators whose generating word (in the standard rewrite) has length at most 15. Using the software packages KBMAG, quotpic and Magma, together with group and number theoretic methods, we show that if 6 ≤ n ≤ 100 then the group is non-trivial. In an appendix we list the 47 cases within 2 ≤ n ≤ 100 for which we know the grou...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Annals of Pure and Applied Logic
سال: 2018
ISSN: 0168-0072
DOI: 10.1016/j.apal.2018.04.007